R(C6, K5) = 21andR(C7, K5) = 25
نویسندگان
چکیده
منابع مشابه
R(C6, K5) = 21andR(C7, K5) = 25
R(C4, K4) = 10 (see [2]) R(C4, K5) = 14 (see [3]) R(C5, K4) = 13, R(C5, K5) = 17 (see [5, 6]) R(Cn, K3) = 2n − 1 (n > 3) (see [4, 7]). In [10], we proved that R(Cn, K4) = 3(n − 1) + 1 (n ≥ 4). In this paper, we will prove that R(Cn, K5) = 4(n − 1)+ 1 (n = 6, 7). The following notations will be used in this paper. If G is a graph, the vertex set (resp. edge set) of G is denoted by V (G) (resp. E...
متن کاملThe Ramsey Number r(K5-P3,K5)
For two given graphs G1 and G2, the Ramsey number r(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Km denote a complete graph of order m and Kn −P3 a complete graph of order n without two incident edges. In this paper, we prove that r(K5 − P3,K5) = 25 without help of computer algorithms.
متن کاملEmbedding Graphs Containing K5-Subdivisions
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partition of the vertices of G\K5 into equivalence classes. As a result, we can reduce a projective planarity or toroidality algorithm to a small constant number of simple planarity checks [6] or to a K3,3-subdivision in the...
متن کاملThe non-anticoagulant heparin-like K5 polysaccharide derivative K5-N,OSepi attenuates myocardial ischaemia/reperfusion injury
Heparin and low molecular weight heparins have been demonstrated to reduce myocardial ischaemia/reperfusion (I/R) injury, although their use is hampered by the risk of haemorrhagic and thrombotic complications. Chemical and enzymatic modifications of K5 polysaccharide have shown the possibility of producing heparin-like compounds with low anticoagulant activity and strong anti-inflammatory effe...
متن کاملIndependent paths and K5-subdivisions
A well known theorem of Kuratowski states that a graph is planar iff it contains no subdivision of K5 or K3,3. Seymour conjectured in 1977 that every 5-connected nonplanar graph contains a subdivision of K5. In this paper, we prove several results about independent paths (no vertex of a path is internal to another), which are then used to prove Seymour’s conjecture for two classes of graphs. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2001
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0442